Switching on and off the full capacity of an M/M/∞ queue
نویسندگان
چکیده
This paper studies optimal switching on and off the full capacity of an M/M/∞ queue with holding, running and switching costs. The main result is that an average-cost optimal policy either always runs the system or is defined by two thresholds M and N, such that the system is switched on at arrival epochs when the number of customers in the system accumulates to N and it is switched off at departured epoch when the number of customers in the system decreases to M.
منابع مشابه
M M m K Queue With Additional Servers and Discouragement (RESEARCH NOTE)
Waiting in long queue is undesirable due to which in some practical situations customers become impatient and leave the system. In such cases providing additional servers can reduce long queue. This investigation deals with multi-server queueing system with additional servers and discouragement. The customers arrive in poisson fashion and are served exponentially by a pool of permanent and addi...
متن کاملOptimal Switching on and off the Entire Service Capacity of a Parallel Queue
This paper studies optimal switching on and off of the entire service capacity of an M/M/∞ queue with holding, running and switching costs. The running costs depend only on whether the system is on or off, and the holding costs are linear. The goal is to minimize average costs per unit time. The main result is that an average-cost optimal policy either always runs the system or is an (M,N)-poli...
متن کاملM/M/1 Feedback Queue Subject to Catastrophe and Repairment
In this paper, an M/M/1 queue with instantaneous Bernoulli feedback is studied in the event of server failure, the catastrophe occurs and after repair, it starts to work again. The transient response for the probability function of the system size is presented. The steady state analysis of system size probabilities and some performance measures of system are provided. Then the resu...
متن کاملBat Algorithm for Optimal Service Parameters in an Impatient Customer N-Policy Vacation Queue
In this paper, a meta-heuristic method, the Bat Algorithm, based on the echolocation behavior of bats is used to determine the optimum service rate of a queue problem. A finite buffer M/M/1 queue with N policy, multiple working vacations and Bernoulli schedule vacation interruption is considered. Under the two customers' impatient situations, balking and reneging, the...
متن کاملM m m Queue with Balking, Reneging and Additional Servers
In this paper, we consider a multi-server queuing system in which additional servers are allowed for a longer queue to reduce the customer’s balking and reneging behavior. The customers are assumed to arrive in Poisson fashion and their service- times follow exponential distribution. The number of servers in long run depends on the queue-length. We obtain equilibrium queue size distribution. Th...
متن کامل